• Ponencia
      Icon

      A Class of P Automata for Characterizing Context-free Languages 

      Vaszil, György (Fénix Editora, 2006)
      We present a characterization of context-free languages in terms of a restricted class of P automata (P systems accepting ...
    • Ponencia
      Icon

      A Note on a New Class of APCol Systems 

      Ciencialová, Lucie; Csuhaj Varjú, Erzsébet; Vaszil, György (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      We introduce a new acceptance mode for APCol systems (Automaton-like P colonies), variants of P colonies where the ...
    • Ponencia
      Icon

      Describing Membrane Computations with a Chemical Calculus 

      Battyányi, Péter; Vaszil, György (Fénix Editora, 2014)
      Membrane systems are nature motivated computational models inspired by certain basic features of biological cells and ...
    • Ponencia
      Icon

      Editing Configurations of P Systems 

      Csuhaj Varjú, Erzsébet; Nola, Antonio di; Paun, Gheorghe; Pérez Jiménez, Mario de Jesús; Vaszil, György (Fénix Editora, 2005)
      This paper proposes and preliminarily investigates the possibility of transforming a configuration (membrane structure and ...
    • Ponencia
      Icon

      Membrane Systems and Time Petri Nets 

      Aman, Bogdan; Battyányi, Péter; Ciobanu, Gabriel; Vaszil, György (Fenix Editora, 2017)
      We investigate the relationship of time Petri nets and di erent variants of membrane systems. First we show that the added ...
    • Ponencia
      Icon

      Membrane Systems with Priority, Dissolution, Promoters and Inhibitors and Time Petri Nets 

      Battyányi, Péter; Vaszil, György (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
      We continue the investigations on exploring the connection between membrane systems and time Petri nets already commenced ...
    • Ponencia
      Icon

      On a Class of P Automata as a Machine Model for Languages over Infinite Alphabets 

      Vaszil, György (Fénix Editora, 2005)
      We show how P automata having a finite description and working with a finite object-alphabet can be used to describe ...
    • Ponencia
      Icon

      On the Classes of Languages Characterized by Generalized P Colony Automata 

      Kántor, Kristóf; Vaszil, György (Fénix, 2016)
      We study the computational power of generalized P colony automata and show how it is in uenced by the capacity of the ...
    • Ponencia
      Icon

      On Very Simple P Colonies 

      Ciencialová, Lucie; Csuhaj Varjú, Erzsébet; Kelemenová, Alice; Vaszil, György (Fénix Editora, 2009)
      We study two very simple variants of P colonies: systems with only one object inside the cells, and systems with ...
    • Ponencia
      Icon

      P Colony Automata with LL(k)-like Conditions 

      Csuhaj Varjú, Erzsébet; Kántor, Kristóf; Vaszil, György (Universidad de Sevilla, Escuela Técnica Superior de Ingeniería Informática, 2018)
      We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages characterized ...
    • Ponencia
      Icon

      P Systems for Social Networks 

      Csuhaj Varjú, Erzsébet; Gheorgue, Marian; Vaszil, György; Oswald, Marion (Fénix Editora, 2011)
      We introduce some variants of P systems that mimic the behaviour of social networks and illustrate some of the characteristics ...
    • Ponencia
      Icon

      PCol Automata: Recognizing Strings with P Colonies 

      Cienciala, Ludek; Ciencialová, Lucie; Csuhaj Varjú, Erzsébet; Vaszil, György (Fénix Editora, 2010)
      We introduce the concept of a P colony automaton, an automata-like con- struct combining properties of finite automata ...
    • Ponencia
      Icon

      Simulating Membrane Systems and Dissolution in a Typed Chemical Calculus 

      Aman, Bogdan; Battyányi, Péter; Ciobanu, Gabriel; Vaszil, György (Fénix Editora, 2015)
      We present a transformation of membrane systems, possibly with pro- moter/inhibitor rules, priority relations, and membrane ...
    • Ponencia
      Icon

      Small Computationally Complete Symport/Antiport P Systems 

      Csuhaj Varjú, Erzsébet; Margenstern, Maurice; Vaszil, György; Verlan, Sergey (Fénix Editora, 2006)
      It is known that P systems with symport/antiport rules simulate the register machines, i.e., they are computationally ...
    • Ponencia
      Icon

      The DBSCAN Clustering Algorithm on P Systems 

      Vaszil, György (Escuela Técnica Superior de Ingeniería Informática, Universidad de Sevilla, 2019)
      We show how to implement the DBSCAN clustering algorithm (Density Based Spatial Clustering of Applications with Noise) on membrane systems using evolution rules with promoters and priorities.